Incremental Classification Rules Based on Association Rules Using Formal Concept Analysis
نویسندگان
چکیده
Concept lattice, core structure in Formal Concept Analysis has been used in various fields like software engineering and knowledge discovery.In this paper, we present the integration of Association rules and Classification rules using Concept Lattice. This gives more accurate classifiers for Classification. The algorithm used is incremental in nature. Any increase in the number of classes, attributes or transactions does not require the access to the previous database. The incremental behavior is very useful in finding classification rules for real time data such as image processing. The algorithm requires just one database pass through the entire database. Individual classes can have different support threshold and pruning conditions such as criteria for noise and number of conditions in the classifier.
منابع مشابه
Analysis of Medical Data using Data Mining and Formal Concept Analysis
data using classification rules in data mining and context reduction in formal concept analysis. It helps in finding redundancies among the various medical examination tests used in diagnosis of a disease. Classification rules have been derived from positive and negative association rules using the Concept lattice structure of the Formal Concept Analysis. Context reduction technique given in Fo...
متن کاملIncremental Discovering Association Rules: A Concept Lattice Approach
Concept lattice is an efficient tool for data analysis. Mining association rules is a important subfield of data mining. In this paper we investigate the ability of concept lattice on associate rules and present an efficient algorithm which generate the large itemsets incrementally on the basis of Godin’s work.
متن کاملIncremental Construction of Alpha Lattices and Association Rules
In this paper we discuss Alpha Galois lattices (Alpha lattices for short) and the corresponding association rules. An alpha lattice is coarser than the related concept lattice and so contains fewer nodes, so fewer closed patterns, and a smaller basis of association rules. Coarseness depends on a a priori classification, i.e. a cover C of the powerset of the instance set I, and on a granularity ...
متن کاملModeling Processes of Inferring Good Maximally Redundant Tests
Good test analysis is considered. Two kinds of classification subtasks are defined: attributive and object ones. Some ideas of modeling and optimization of inferring good maximally redundant tests are formalized. An algorithm of inferring good maximally redundant tests based on the decomposition into attributive subtasks is given, where good maximally redundant tests are regarded as concepts of...
متن کاملElastic/plastic Buckling Analysis of Skew Thin Plates based on Incremental and Deformation Theories of Plasticity using Generalized Differential Quadrature Method
Abstract In this study, generalized differential quadrature analysis of elastic/plastic buckling of skew thin plates is presented. The governing equations are derived for the first time based on the incremental and deformation theories of plasticity and classical plate theory (CPT). The elastic/plastic behavior of plates is described by the Ramberg-Osgood model. The ranges of plate geometries...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005